Information Theoretic Distinguishers for Timing Attacks with Partial Profiles: Solving the Empty Bin Issue

نویسندگان

چکیده

In any side-channel attack, it is desirable to exploit all the available leakage data compute distinguisher’s values. The profiling phase essential obtain an accurate model, yet may not be exhaustive. As a result, information theoretic distinguishers come up on previously unseen data, phenomenon yielding empty bins. A strict application of maximum likelihood method yields distinguisher that even sound. Ignoring bins reestablishes soundness, but seriously limits its performance in terms success rate. purpose this paper remedy situation. research, we propose six different techniques improve distinguishers. We study them thoroughly by applying timing attacks, both with synthetic and real leakages. Namely, compare rate, show their depends amount profiling, can explained bias-variance analysis. result our work there exist use-cases, especially when measurements are noisy, where novel (typically soft-drop distinguisher) perform best compared known distinguishers, despite bin

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Information-Theoretic Attacks in the Smart Grid

Gaussian random attacks that jointly minimize the amount of information obtained by the operator from the grid and the probability of attack detection are presented. The construction of the attack is posed as an optimization problem with a utility function that captures two effects: firstly, minimizing the mutual information between the measurements and the state variables; secondly, minimizing...

متن کامل

An information-theoretic and game-theoretic study of timing channels

This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for continuous-time or discrete-time packet waveforms. Fluid waveform approximations of each of these classes of waveforms are employed to aid in analysis. Channel capacity is defined and an information-theoretic game ba...

متن کامل

Automatically deriving information-theoretic bounds for adaptive side-channel attacks

We present a model of adaptive attacks which we combine with information-theoretic metrics to quantify the information revealed to an adaptive adversary. This enables us to express an adversary’s remaining uncertainty about a secret as a function of the number of interactions with the system under attack. We present algorithms and approximation methods for computing this function. The main appl...

متن کامل

Heuristics for Solving the Bin-Packing Problem with Conflicts

This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to packing items of maximal-stable-subsets ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of information security

سال: 2021

ISSN: ['2153-1242', '2153-1234']

DOI: https://doi.org/10.4236/jis.2021.121001